Imitation Programming Unorganised Machines
نویسنده
چکیده
In 1948 Alan Turing presented a general representation scheme by which to achieve artificial intelligence – his unorganised machines. Further, at the same time as also suggesting that natural evolution may provide inspiration for search, he noted that mechanisms inspired by the cultural aspects of learning may prove useful. This chapter presents results from an investigation into using Turing’s dynamical network representation designed by a new imitation-based, i.e., cultural, approach. Moreover, the original synchronous and an asynchronous form of unorganised machines are considered, along with their implementation in memristive hardware.
منابع مشابه
Toward Turing's A-type Unorganised Machines in an Unconventional Substrate: a Dynamic Representation in Compartmentalised Excitable Chemical Media
Turing presented a general representation scheme by which to achieve artificial intelligence – unorganised machines. Significantly, these were a form of discrete dynamical system and yet such representations remain relatively unexplored. Further, at the same time as also suggesting that natural evolution may provide inspiration for search mechanisms to design machines, he noted that mechanisms ...
متن کاملUnorganised Machines in Learning Classifier Systems
Many representations have been presented to enable the effective evolution of computer programs. Turing was perhaps the first to present a general scheme by which to achieve this end. Significantly, Turing proposed a form of discrete dynamical system and yet dynamical representations remain almost unexplored within genetic programming. This paper presents results from an initial investigation i...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flowtime through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters with it, this is why in recent decades extensive researches have been done on scheduling issues. A type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical ...
متن کاملProgressive surface modelling scheme from unorganised curves
This paper presents a novel surface modelling scheme to construct a freeform surface progressively from unorganised curves representing the boundary and interior characteristic curves. The approach can construct a base surface model from four ordinary or composite boundary curves and support incremental surface updating from interior characteristic curves, some of which may not be on the final ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013